On the Number of Mutually Disjoint Cyclic Designs
نویسندگان
چکیده
We denote by LS[N ](t, k, v) a large set of t-(v, k, λ) designs of size N , which is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs and N = ( v−t k−t ) /λ. We use the notation N(t, v, k, λ) as the maximum possible number of mutually disjoint cyclic t-(v, k, λ)designs. In this paper we give some new bounds for N(2, 29, 4, 3) and N(2, 31, 4, 2). Consequently we present new large sets LS[9](2, 4, 29), LS[13](2, 4, 29) and LS[7](2, 4, 31), where their existences were already known.
منابع مشابه
Mutually Disjoint Steiner Systems S(5, 8, 24) and 5-(24,12,48) Designs
We demonstrate that there are at least 50 mutually disjoint Steiner systems S(5, 8, 24) and there are at least 35 mutually disjoint 5-(24, 12, 48) designs. The latter result provides the existence of a simple 5-(24, 12, 6m) design for m = 24, 32, 40, 48, 56, 64, 72, 80, 112, 120, 128, 136, 144, 152, 160, 168, 200, 208, 216, 224, 232, 240, 248 and 256.
متن کاملMutually disjoint t-designs and t-SEEDs from extremal doubly-even self-dual codes
It is known that extremal doubly-even self-dual codes of length n ≡ 8 or 0 (mod 24) yield 3or 5-designs respectively. In this paper, by using the generator matrices of bordered double circulant doubly-even self-dual codes, we give 3-(n, k; m)-SEEDs with (n, k, m) ∈ {(32, 8, 5), (56, 12, 9), (56, 16, 9), (56, 24, 9), (80, 16, 52)}. With the aid of computer, we obtain 22 generator matrices of bor...
متن کاملPerfect Triangle Families
The Dual Theorem of Lucchesi and Younger [3] states that in every (finite) planar directed graph, there is a minimum feedback set (an edge set containing at least one edge of each directed circuit) whose cardinality is equal to the maximum number of mutually edge-disjoint directed circuits. In this note we prove that an analogue of this classical result remains valid when 3-circuits (that is, t...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملSmooth Kummer Surfaces in Projective Three-space
In this note we prove the existence of smooth Kummer surfaces in projective three-space containing sixteen mutually disjoint smooth rational curves of any given degree. Introduction Let X be a smooth quartic surface in projective three-space P. As a consequence of Nikulin’s theorem [6] X is a Kummer surface if and only if it contains sixteen mutually disjoint smooth rational curves. The classic...
متن کامل